منابع مشابه
CSP Search with Responsibility Sets and Kernels
We introduce data structures called responsibility set and kernel. We present an algorithm FCRK, which is a modification of FC that maintains these structures and uses them for pruning of the search space. According to our experimental evaluation, FC-RK outperforms FC-CBJ on constraint networks encoding graph k-coloring instances and on non-dense random binary constraint networks.
متن کاملHeat kernels and sets with fractal structure
In these notes I will concentrate mainly on heat kernel estimates on ‘pre-fractal graphs’ – for what these are see below. In the final section I will then explain briefly how these estimates can be used to define diffusion processes on some regular true fractal sets. For other (mathematical) surveys of this area see [3], [48], and Kigami’s book [33]. A survey of the physics literature can be fo...
متن کاملec 2 01 2 COORDINATE SUM AND DIFFERENCE SETS OF d - DIMENSIONAL MODULAR HYPERBOLAS
Many problems in additive number theory, such as Fermat’s last theorem and the twin prime conjecture, can be understood by examining sums or differences of a set with itself. A finite set A ⊂ Z is considered sum-dominant if |A+A| > |A−A|. If we consider all subsets of {0, 1, . . . , n−1}, as n → ∞ it is natural to expect that almost all subsets should be difference-dominant, as addition is comm...
متن کاملSemigroup Kernels on Finite Sets
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of positive definite (p.d.) kernels for two such objects that can be expressed as a function of the merger of their respective sets of components. We prove a general integral representation of such kernels and present two par...
متن کاملSmallest defining sets of designs associated with PG(d, 2)
For d 2:: 2, let Dd be the symmetric block design formed from the points and hyperplanes of the projective space PG(d, 2). Let 3d equal the number of blocks in a smallest defining set of Dd . The known results 32 = 3 and S3 = 9 are reviewed and it is shown that 34 = 24 and 52 :::; 35 :::; 55. If J-Ld = 3d/ (2d+ 1 1) is the proportion of blocks in a smallest defining set of Dd, then J-L2 = 3/7, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1978
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1978.77.51